Dynamic monopolies and feedback vertex sets in hexagonal grids
نویسندگان
چکیده
منابع مشابه
Feedback Vertex Sets in Tournaments
We study combinatorial and algorithmic questions around minimal feedback vertex sets in tournament graphs. On the combinatorial side, we derive strong upper and lower bounds on the maximum number of minimal feedback vertex sets in an n-vertex tournament. We prove that every tournament on n vertices has at most 1.6740 minimal feedback vertex sets and that there is an infinite family of tournamen...
متن کاملFeedback vertex sets in star graphs
In a graph G= (V ,E), a subset F ⊂ V (G) is a feedback vertex set of G if the subgraph induced by V (G) \ F is acyclic. In this paper, we propose an algorithm for finding a small feedback vertex set of a star graph. Indeed, our algorithm can derive an upper bound to the size of the feedback vertex set for star graphs. Also by applying the properties of regular graphs, a lower bound can easily b...
متن کاملSmall Feedback Vertex Sets in Planar Digraphs
Let G be a directed planar graph on n vertices, with no directed cycle of length less than g > 4. We prove that G contains a set X of vertices such that G−X has no directed cycle, and |X| 6 5n−5 9 if g = 4, |X| 6 2n−5 4 if g = 5, and |X| 6 2n−6 g if g > 6. This improves recent results of Golowich and Rolnick. A directed graph G (or digraph, in short) is said to be acyclic if it does not contain...
متن کاملOn cycle packings and feedback vertex sets
For a graph G, let fvs and cp denote the minimum size of a feedback vertex set in G and the maximum size of a cycle packing in G, respectively. Kloks, Lee, and Liu conjectured that fvs(G) ≤ 2 cp(G) if G is planar. They proved a weaker inequality, replacing 2 by 5. We improve this, replacing 5 by 3, and verifying the resulting inequality for graphs embedded in surfaces of nonnegative Euler chara...
متن کاملMinimum feedback vertex sets in circle graphs
We describe a polynomial time algorithm to find a minimum feedback vertex set, or equivalently, a maximum induced forest, in a circle graph. The circle graphs are the overlap graphs of intervals on a line.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computers & Mathematics with Applications
سال: 2011
ISSN: 0898-1221
DOI: 10.1016/j.camwa.2011.09.047